OpenGL-assisted Visibility Queries of Large Polygonal Models

نویسندگان

  • Tobias Hüttner
  • Michael Meißner
  • Dirk Bartz
چکیده

We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of OpenGL-assisted frustum culling, hierarchical model-space partitioning, and OpenGL based occlusion culling, we achieve a significant better performance on general polygonal models than previous approaches. In contrast to these approaches, we only exploit common OpenGL features and therefore, our algorithm is also well suited for low-end OpenGL hardware. Furthermore, we propose a small addition to the OpenGL rendering pipeline, to enhance the framebuffer’s ability for faster visibility queries. CR Categories: I.3.5 [Computer Graphics]: Visibility Culling— ; I.3.7 [Three-Dimensional Graphics and Realism]: Hidden Line/Surface Removal—;

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OpenGL-assisted occlusion culling for large polygonal models

We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of hierarchical model-space partitioning, OpenGL-assisted view-frustum culling, and OpenGL-assisted occlusion culling, we achieve a significantly better performance on general polygonal models than previous approaches. In contrast to these approaches, we...

متن کامل

Efficient occlusion culling for large model visualization

Occlusion and visibility culling is one of the major techniques to reduce the geometric complexity of large polygonal models. Since the introduction of hardware assisted-occlusion culling in OpenGL (as an extension), solely software-based approaches are losing relevance rapidly for applications which cannot exploit specific knowledge of the scene geometry. However, there are still several issue...

متن کامل

Visibility Preprocessing for Complex 3d Scenes Using Hardware-visibility Queries

In cases of densely occluded urban scenes, it is effective to determine the visibility of scenes, since only small parts of the scene are visible from a given cell. In this paper, we introduce a new visibility preprocessing method that efficiently computes potentially visible objects for volumetric cells. The proposed method deals with general 3D polygonal models and invisible objects jointly b...

متن کامل

Fast 3D Geometric Proximity Queries between Rigid and Deformable Models Using Graphics Hardware Acceleration

We present an approach for computing generalized proximity information between arbitrary polygonal models using graphics hardware acceleration. Our algorithm combines object-space localization, multi-pass rendering techniques, and accelerated distance field computation to perform complex proximity queries at interactive rates. It is applicable to any closed, possibly non-convex, polygonal objec...

متن کامل

A Hardware Assisted Ldi Building Algorithm with Application to Hybrid Volume Rendering

This paper proposes a new hardware-assisted LDI Building algorithm with application to hybrid volume rendering. It works by creating Layered Depth Image (LDI) using OpenGL. Together with LDI, the scene can be rendered by intermixing segmented volume data and stored depth lists easily. The highlight of our algorithm is that it creates a z-sorting list simply by using depth and stencil buffer in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998